Numerical integration as a finite matrix approximation to multiplication operator
نویسندگان
چکیده
منابع مشابه
Analysis of a randomized approximation scheme for matrix multiplication
This note gives a simple analysis of a randomized approximation scheme for matrix multiplication proposed by [Sar06] based on a random rotation followed by uniform column sampling. The result follows from a matrix version of Bernstein’s inequality and a tail inequality for quadratic forms in subgaussian random vectors.
متن کاملNumerical Experiments with Toeplitz Matrix Approximation Methods
Positive semidefinite Toeplitz matrix constraints arise naturally in a variety of problems in engineering. This paper deals with the numerical of this problem. Our approach is based on (i) interior point primal-dual path-following method; (ii) a projection algorithm which converges globally but slowly; (iii) the filterSQP method which is faster. Hybrid methods that attempt to combine the best f...
متن کاملSpectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
Understanding the singular value spectrum of a matrix A ∈ Rn×n is a fundamental task in countless numerical computation and data analysis applications. In matrix multiplication time, it is possible to perform a full SVD of A and directly compute the singular values σ1, . . . , σn. However, little is known about algorithms that break this runtime barrier. Using tools from stochastic trace estima...
متن کاملHeterogeneous Matrix-Matrix Multiplication or Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms
In this pape6 we deal with n ~ o geometric problems arising froin heterogeneous parallel computing: how to partition the unit square irito p rectangles of given area SI, sa, . . . sp (such that E:='=, s = l), so as to minimize (i) either the sum of the p perimeters of the rectangles (i i) or the largest perimeter of the p rectangles. For both problems, we prove NP-completeness and we introduce ...
متن کاملImproving the Numerical Stability of Fast Matrix Multiplication
Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest. Apart from Strassen’s original algorithm, few fast algorithms have been efficiently implemented or used in practical applications. However, there exist many practical alternatives to Strassen’s algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2019
ISSN: 0377-0427
DOI: 10.1016/j.cam.2018.12.031